منابع مشابه
Orbits of Boolean Functions
The group of congruences and permutations of the two-colored N-dimensional Boolean cube is considered. The total number of orbits generated by these automorphisms are shown to scale as 22”/(2y+‘N!) when N tends to infinity. The probability that a randomly chosen function will belong to an orbit containing the maximum possible number of elements, 2’v+’ N!, approaches one as N goes to infinity. S...
متن کاملOn Pivot Orbits of Boolean Functions
We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with respect to the {I,H}n and {I,H,N}n sets of transforms. We also construct a family of Boolean functions of degree higher than two with a large number of flat spectr...
متن کاملBoolean Functions
Written by prominent experts in the field, this monograph provides the first comprehensive and unified presentation of the structural, algorithmic, and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. It presentswithin this framework the fundamental elements...
متن کاملApproximation of Boolean Functions
This paper deals with the number of monochromatic combinatorial rectangles required to approximate a Boolean function on a constant fraction of all inputs, where each rectangle may be defined with respect to its own partition of the input variables. The main result of the paper is that the number of rectangles required for the approximation of Boolean functions in this model is very sensitive t...
متن کاملMinimization of Boolean Functions
This thesis presents two new methods of test-per-clock BIST design for combinational circuits. One of them is based on a transformation of the PRPG code words into test patterns generated by an ATPG tool. This transformation is done by a combinational circuit. For a design of such a circuit two major tasks have to be solved: first, the proper matching between the PRPG code words and the test pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00092-3